Matching and edge-connectivity in regular graphs
نویسندگان
چکیده
منابع مشابه
Matching and edge-connectivity in regular graphs
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper, we characterized when equality holds. In this paper, we prove a lower bound for the minimum size of a maximum matching in an l-edge-connected k-regular graph with n vertices, for l ≥ 2 and k ≥ 4. Again it is sharp for...
متن کاملEigenvalues and edge-connectivity of regular graphs
In this paper, we show that if the second largest eigenvalue of a d-regular graph is less than d − 2(k−1) d+1 , then the graph is k-edge-connected. When k is 2 or 3, we prove stronger results. Let ρ(d) denote the largest root of x3 − (d− 3)x2 − (3d− 2)x− 2 = 0. We show that if the second largest eigenvalue of a d-regular graph G is less than ρ(d), then G is 2-edge-connected and we prove that if...
متن کاملRestricted Edge Connectivity of Regular Graphs
An edge cut that separates the connected graph into components with order at least two is restricted edge cut. The cardinality of minimum restricted edge cut is restricted edge connectivity. Denote byλ′ ( G) the restricted edge connectivity , then λ′( G) ≤ξ( G) where ξ( G) is the minimum edge degree. G is called maximal restricted edge connected if the equality in the previous inequality holds....
متن کاملEdge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
In this paper, we study the relationship between eigenvalues and the existence of certain subgraphs in regular graphs. We give a condition on an appropriate eigenvalue that guarantees a lower bound for the matching number of a t-edge-connected d-regular graph, when t ≤ d − 2. This work extends some classical results of von Baebler and Berge and more recent work of Cioabă, Gregory, and Haemers. ...
متن کاملk - factors in regular graphs and edge - connectivity
Let , m , n , r be integers such that 2 ≤ ≤ r , r ≥ 4 and m , n ≥ 0 . Suppose G is an r -regular -edge-connected graph and that k is an even integer with m ≤ k ≤ r 2 . We say that G is an (m,n; k) -factor graph if for each disjoint pair E1, E2 ⊆ E(G) with |E1| = m and |E2| = n , G has a k -factor F such that E1 ⊆ E(F ) and E2 ∩E(F ) = ∅ . In this note we consider when G is an (m,n; k) -factor g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2010.10.005